Two-Way Nanoscale Automata
نویسندگان
چکیده
In this paper, we compare the computational power of two-way Watson–Crick automata and Quantum finite automata. The language $${\text{L}} = \left\{ {\left. {{\text{xx}}} \right|{\text{x}} \in {{\mathbf{a}},{\mathbf{b}}} \right\}^{*} } \right\}$$ is accepted by but not quantum
منابع مشابه
Two-Way Two-Tape Automata
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such alternating automata are not closed under complementation for non-unary alphabets. This improves a similar result of Kari and Moore for picture languages. We also show that these deterministic, non-deterministic and alterna...
متن کاملTropical Two-Way Automata
In this paper we study two-way min-plus automata. We prove that two-way distance automata are equivalent to one-way distance automata. In the second part of the paper we show that, with general min-plus semirings, it is decidable whether every accepted word has a weight different from −∞ and that, in contrast, it is undecidable whether there exists a word accepted with a weight different from −∞.
متن کاملThe Reduction of Two-Way Automata to One-Way Automata
We describe a new elementary reduction of two-way automata to one-way automata. The reduction is based on the subset construction rather than on crossing sequence analysis.
متن کاملComplementing Two-Way Finite Automata
We study the relationship between the sizes of two-way finite automata accepting a language and its complement. In the deterministic case, for a given automaton (2dfa) with n states, we build an automaton accepting the complement with at most 4n states, independently of the size of the input alphabet. Actually, we show a stronger result, by presenting an equivalent 4n-state 2dfa that always hal...
متن کاملTwo-Way Automata in Coq
We formally verify translations from two-way automata to one-way automata based on results from the literature. Following Vardi, we obtain a simple reduction from nondeterministic two-way automata to one-way automata that leads to a doubly-exponential increase in the number of states. By adapting the work of Shepherdson and Vardi, we obtain a singlyexponential translation from nondeterministic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in intelligent systems and computing
سال: 2021
ISSN: ['2194-5357', '2194-5365']
DOI: https://doi.org/10.1007/978-981-15-9927-9_59